Maximum packing for k-connected partial k-trees in polynomial time
نویسندگان
چکیده
منابع مشابه
A Polynomial-Time Algorithm for Finding Total Colorings of Partial k-Trees
A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, in such a way that no two adjacent or incident elements receive the same color. Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by a constant k). However, no polynomial-time algorithm has been known for the problem of finding a total coloring of a giv...
متن کاملEdge-Coloring Partial k-Trees
Ž Many combinatorial problems can be efficiently solved for partial k-trees graphs . of treewidth bounded by k . The edge-coloring problem is one of the well-known combinatorial problems for which no efficient algorithms were previously known, except a polynomial-time algorithm of very high complexity. This paper gives a linear-time sequential algorithm and an optimal parallel algorithm which f...
متن کاملSpanning k-Trees of n-Connected Graphs
A tree is called a k-tree if the maximum degree is at most k. We prove the following theorem, by which a closure concept for spanning k-trees of n-connected graphs can be defined. Let k ≥ 2 and n ≥ 1 be integers, and let u and v be a pair of nonadjacent vertices of an n-connected graph G such that degG(u)+degG(v) ≥ |G|−1−(k−2)n, where |G| denotes the order of G. Then G has a spanning k-tree if ...
متن کاملEfficient Sets in Partial k-Trees
Telle, J.A. and A. Proskurowski, Efficient sets in partial k-trees, Discrete Applied Mathematics 44
متن کاملOptimal Spanners in Partial k-Trees
10 edges are bounded by 2n, since the degree of each vertex x not chosen at stpe (ii) above is at most 2. Thus the nummber of edges in E 0 is bounded by 2n+m?1 which is bounded by 3n. However verifying that G 0 is an optimal 2{spanner is diicult and will not be presented here. 2
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00208-x